In this one-semester course, we choose domination theory as the main content. Domination in graph theory has many applications in the real world such as location problems. A dominating set of a graph G = (V, E) is a subset D of V such that every vertex not in D is adjacent to at least one vertex in D. The domination problem is to determine the domination number gamma(G) of a graph G that is the minimum size of a dominating set of G. Although many theoretic theorems for domination and its variations have been established for a long time, the first algorithmic result on this topic was given by Cockayne, Goodman and Hedetniemi in 1975. They gave a linear-time algorithm for the domination problem in trees by using a labeling method. On the other hand, at about the same time, Garey and John constructed the first (unpublished) proof that the domination problem is NP-complete. Since then, many algorithmic results are studied for variations of the domination problem in different classes of graphs. The content of this course covers the survey of the development on this line during the past 36 years. Polynomial-time algorithms using labeling method, dynamic programming method and primal-dual method are surveyed on trees, interval graphs, strongly chordal graphs, permutation graphs, cocomparability graphs and distance-hereditary graphs. NP-completeness results on domination are also discussed.